81 | Add to Reading ListSource URL: www.econ.brown.eduLanguage: English - Date: 2013-06-19 07:39:31
|
|---|
82 | Add to Reading ListSource URL: dss.in.tum.deLanguage: English - Date: 2010-10-13 06:04:13
|
|---|
83![Questions Answered. In Theory. http://cstheory.stackexchange.com∗ Perhaps you’re a computer scientist wondering how much the Axiom of Choice matters to the theorems you study and prove[21]. Perhaps you’re a mathema](https://www.pdfsearch.io/img/22aba43b3d0243e6d3a2c28159c3ae98.jpg "Questions Answered. In Theory. http://cstheory.stackexchange.com∗ Perhaps you’re a computer scientist wondering how much the Axiom of Choice matters to the theorems you study and prove[21]. Perhaps you’re a mathema") | Add to Reading ListSource URL: www.cs.utah.eduLanguage: English - Date: 2010-11-05 18:41:12
|
|---|
84 | Add to Reading ListSource URL: www.math.ias.eduLanguage: English - Date: 2006-03-15 13:50:29
|
|---|
85![A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA[removed]](https://www.pdfsearch.io/img/79707b1bf43a7b06eabc50276dbe8622.jpg "A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA[removed]") | Add to Reading ListSource URL: stuff.mit.eduLanguage: English - Date: 2009-05-25 23:54:59
|
|---|
86 | Add to Reading ListSource URL: dss.in.tum.deLanguage: English - Date: 2013-01-24 06:29:17
|
|---|
87![Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states Fabio L. Traversa,1, 2, ∗ Chiara Ramella,2, † Fabrizio Bonani,2, ‡ and Massimiliano Di Ventra1, § arXiv:[removed]](https://www.pdfsearch.io/img/edebe9cdf662d075997eda271dd094d1.jpg "Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states Fabio L. Traversa,1, 2, ∗ Chiara Ramella,2, † Fabrizio Bonani,2, ‡ and Massimiliano Di Ventra1, § arXiv:[removed]") | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2014-12-03 20:27:51
|
|---|
88![Review of1 of The P = NP Question and Godel’s Lost Letter by Richard J. Lipton Springer, [removed]pages, Hardcover Review by](https://www.pdfsearch.io/img/63ae25706fdf2574f86c8dfbc3a6aafb.jpg "Review of1 of The P = NP Question and Godel’s Lost Letter by Richard J. Lipton Springer, [removed]pages, Hardcover Review by") | Add to Reading ListSource URL: www.cs.umd.eduLanguage: English - Date: 2010-10-04 09:51:41
|
|---|
89![Joint Review of1 Computational Complexity: A Conceptual Perspective by Oded Goldreich Published by Cambridge University Press, [removed]pages, Hardcover and](https://www.pdfsearch.io/img/add24b6d2f46dd1c36dc44aa3820af38.jpg "Joint Review of1 Computational Complexity: A Conceptual Perspective by Oded Goldreich Published by Cambridge University Press, [removed]pages, Hardcover and") | Add to Reading ListSource URL: www.cs.umd.eduLanguage: English - Date: 2010-09-24 20:19:20
|
|---|
90 | Add to Reading ListSource URL: www.cccg.caLanguage: English - Date: 2004-08-23 15:27:23
|
|---|